Fast Nondeterministic Recognition of Context-Free Languages Using two Queues
نویسنده
چکیده
We show how to accept a context-free language nondeterministically in O( n log n) time on a two-queue machine.
منابع مشابه
QRT FIFO Automata, Breath-First Grammars and Their Relations
Cherubini, A., C. Citrini, S.C. Reghizzi, and D. Mandrioli, QRT FIFO automata, breadth-first grammars and their relations, Theoretical Computer Science 85 (1991) 171-203. Some classes of queue automata (deterministic and nondeterministic), i.e. machines equipped with one or more FIFO tapes, and corresponding languages are considered. For quasi-real-time (QRT) deterministic machines, recognition...
متن کاملFast Recognition of Pushdown Automaton Context-free Languages
We prove: (1) every language accepted by a two-way nondeterministic pushdown automaton can be recognized on a random access machine in O(n3/log n) time; (2) every language accepted by a loop-free two-way nondeterministic pushdown automaton can be recognized in O(n3/log 2 n) time; (3) every context-free language can be recognized onqine in O(n3/log z n) time. We improve the results of Aho, Hopcr...
متن کاملOn the Intersection of Stacks and Queues
What do a pushdown stack and a queue have in common? What is their intersection? Is it a counter? If we add a retrieval restriction, what is the intersection of a one-reversal pushdown and a queue, or, by symmetry, of a one-reset tape and a pushdown, or both, a one-reversal pushdown and a one-reset queue? Is it a one-reversal counter? These and similar claims are conjectured by Autebert et al. ...
متن کاملTopological dynamics and recognition of languages
We define compact automata and show that every language has a unique minimal compact automaton. We also define recognition of languages by compact left semitopological monoids and construct the analogue of the syntactic monoid in this context. For rational languages this reduces to the usual theory of finite automata and finite monoids.
متن کاملPreset Two-head Automata and Morphological Analysis of Natural Language*
Modeling the morphological structure of natural languages in terms of a nondeterministic finite-state automaton is shown to be inadequate in its handling of some common natural language phenomena. We show that a two-tape nondeterministic automaton is capable of handling these phenomena. The modeling is improved by the specification of a new type of automaton, the preset two-head automaton, whic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Inf. Process. Lett.
دوره 67 شماره
صفحات -
تاریخ انتشار 1998